problem-solving program

См. также в других словарях:

• Future Problem Solving Program International — The Future Problem Solving Program International (FPSPI), formerly known as the Future Problem Solving Program (FPSP), is an international academic competition. Over 250,000 students internationally participate in the Future Problem Solving… …   Wikipedia

• Wisconsin Future Problem Solving Program — The Wisconsin Future Problem Solving Program, an affiliate Future Problem Solving program, was begun in 1981 by Bill Hartje and Marilyn Bendiksen. Currently, over 1,000 students statewide participate in some aspect of the program, which is run by …   Wikipedia

• List of Future Problem Solving Program affiliates — This is a list of affiliates of the Future Problem Solving Program. An FPSPI affiliate administrates Future Problem Solving competitions and guidelines at a local level. Typically each state or province has its own affiliate. *… …   Wikipedia

• Creative problem solving — is the mental process of creating a solution to a problem. It is a special form of problem solving in which the solution is independently created rather than learned with assistance. Creative problem solving always involves creativity. To qualify …   Wikipedia

• Art of Problem Solving Foundation — The Art of Problem Solving Foundation is a 501(c)3 non profit corporation created to providing resources and opportunities for avid students of mathematics. Note that the foundation is not the same thing as Art of Problem Solving itself, which is …   Wikipedia

• Problem gambling — Classification and external resources ICD 10 F63.0 ICD 9 312.31 …   Wikipedia

• General Problem Solver — El General Problem Solver (GPS), en español Solucionador General de Problemas, es un programa de ordenador creado en 1957 por Herbert Simon, J.C. Shaw, y Allen Newell con el objetivo de construir una máquina capaz de resolver problemas de… …   Wikipedia Español

• General Problem Solver — (GPS) was a computer program created in 1957 by Herbert Simon and Allen Newell to build a universal problem solver machine. Any formalized symbolic problem can be solved, in principle, by GPS. For instance: theorems proof, geometric problems and… …   Wikipedia

• program — [prō′gram΄, prō′grəm] n. [< LL & Fr: Fr programme < LL programma < Gr, edict < prographein, to write in public < pro , before + graphein, to write: see PRO 1 & GRAPHIC] 1. Obs. a) a proclamation b) a prospectus or syllabus …   English World dictionary

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia